Journal article
A multi-class multi-server accumulating priority queue with application to health care
AB Sharif, DA Stanford, P Taylor, I Ziedins
Operations Research for Health Care | Elsevier | Published : 2014
Abstract
We consider the accumulating priority queue (APQ), a priority queue where customer priorities are a function of their waiting time. This time-dependent priority model was first proposed by Kleinrock (1964), and, more recently, Stanford etal. (2013) derived the waiting time distributions for the various priority classes when the queue has a single server. The present work derives expressions for the waiting time distributions for a multi-server APQ with Poisson arrivals for each class, and a common exponential service time distribution. It also comments on how to choose feasible accumulation rates to satisfy specified performance objectives for each class.
Related Projects (4)
Grants
Awarded by Natural Sciences and Engineering Research Council of Canada
Funding Acknowledgements
The work of Azaz Bin Sharif and David Stanford has been supported by the latter's NSERC Discovery grant. Peter Taylor would like to thank the Australian Research Council for supporting his work through Linkage Grant LP0349153 and Discovery Grant DP110101663. Ilze Ziedins' work was funded by a grant from the Science FRDF at the University of Auckland.